Detecting induced star-like minors in polynomial time
نویسندگان
چکیده
The INDUCED MINOR problem is to test whether a graph G contains a graph H as an induced minor, i.e., if G can be modified into H by a sequence of vertex deletions and edge contractions. When H is fixed, i.e., not part of the input, this problem is denoted H -INDUCED MINOR. We provide polynomialtime algorithms for this problem in the case that the fixed target graph has a starlike structure. In particular, we show polynomial-time solvability for all forests H on at most seven vertices except for one such case.
منابع مشابه
Semistar dimension of polynomial rings and Prufer-like domains
Let $D$ be an integral domain and $star$ a semistar operation stable and of finite type on it. We define the semistar dimension (inequality) formula and discover their relations with $star$-universally catenarian domains and $star$-stably strong S-domains. As an application, we give new characterizations of $star$-quasi-Pr"{u}fer domains and UM$t$ domains in terms of dimension inequal...
متن کاملOn integer program with bounded minors and flatness theorem
Let A be an m × n integral matrix of rank n. We say that A has bounded minors if the maximum of the absolute values of the n × n minors is at most k, where k is a some natural constant. We will call that matrices like k-modular. We investigate an integer program max{cx : Ax ≤ b, x ∈ Zn} where A is k-modular. We say that A is almost unimodular (see [2, 5]) if it is 2-modular and the absolute val...
متن کاملDetecting Induced Minors in AT-Free Graphs
The Induced Minor problem is that of testing whether a graph G can be modified into a graph H by a sequence of vertex deletions and edge contractions. If only edge contractions are permitted, we obtain the Contractibility problem. We prove that Induced Minor is polynomial-time solvable when G is AT-free and H is fixed, i.e., not part of the input. In addition, we show that Contractiblity is pol...
متن کاملA note on contracting claw-free graphs
A graph containment problem is that of deciding whether one graph called the host graph can be modified into some other graph called the target graph by using a number of specified graph operations. We consider edge deletions, edge contractions, vertex deletions and vertex dissolutions as possible graph operations permitted. By allowing any combination of these four operations we capture the fo...
متن کاملFinding an induced path of given parity in planar graphs in polynomial time
The problem of deciding, given a graph G and two vertices s and t, whether there exists an induced path of given parity between s and t in G is known to be NP-complete. We show how to solve the problem in O(|V (G)|) time, when the input graph is planar. We use techniques from the theory of graph minors as well as the theory of perfect graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 17 شماره
صفحات -
تاریخ انتشار 2012